0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.16	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.17/0.38	% Computer   : n007.cluster.edu
0.17/0.38	% Model      : x86_64 x86_64
0.17/0.38	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.17/0.38	% Memory     : 8042.1875MB
0.17/0.38	% OS         : Linux 3.10.0-693.el7.x86_64
0.17/0.38	% CPULimit   : 1200
0.17/0.38	% WCLimit    : 120
0.17/0.38	% DateTime   : Tue Jul 13 16:14:19 EDT 2021
0.17/0.38	% CPUTime    : 
0.17/0.38	% Number of cores: 8
0.17/0.38	% Python version: Python 3.6.8
0.17/0.38	# Version: 2.6rc1-ho
0.17/0.40	# No SInE strategy applied
0.17/0.40	# Trying AutoSched0 for 59 seconds
1.69/1.89	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
1.69/1.89	# and selection function SelectCQIPrecWNTNp.
1.69/1.89	#
1.69/1.89	# Preprocessing time       : 0.089 s
1.69/1.89	# Presaturation interreduction done
1.69/1.89	# SatCheck found unsatisfiable ground set
1.69/1.89	
1.69/1.89	# Proof found!
1.69/1.89	# SZS status Theorem
1.69/1.89	# SZS output start CNFRefutation
1.69/1.89	thf(fact_264_old_Opath2__hd, axiom, ![X7:g, X8:node, X9:list_node, X10:node]:((X8)=(hd_node @ X9)<=graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X8 @ X9 @ X10), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_264_old_Opath2__hd)).
1.69/1.89	thf(fact_126__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062i_Ari_O_A_092_060lbrakk_062g_A_092_060turnstile_062_AdefNode_Ag_Ar_Nri_092_060rightarrow_062i_059_Ai_A_092_060in_062_Aset_Ams_059_A_092_060forall_062n_092_060in_062set_A_Ibutlast_Ari_J_O_An_A_092_060notin_062_Aset_Ams_059_Aprefix_Ari_Ars_092_060rbrakk_062_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062, axiom, ~(![X145:node, X146:list_node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ X146 @ X145=>(member_node @ X145 @ (set_node2 @ ms)=>(~(prefix_node @ X146 @ rs2)<=![X12:node]:(~(member_node @ X12 @ (set_node2 @ ms))<=member_node @ X12 @ (set_node2 @ (butlast_node @ X146))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_126__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062i_Ari_O_A_092_060lbrakk_062g_A_092_060turnstile_062_AdefNode_Ag_Ar_Nri_092_060rightarrow_062i_059_Ai_A_092_060in_062_Aset_Ams_059_A_092_060forall_062n_092_060in_062set_A_Ibutlast_Ari_J_O_An_A_092_060notin_062_Aset_Ams_059_Aprefix_Ari_Ars_092_060rbrakk_062_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062)).
1.69/1.89	thf(fact_4_ri__props_I1_J, axiom, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_4_ri__props_I1_J)).
1.69/1.89	thf(fact_5_old_Opath2__app, axiom, ![X7:g, X8:node, X9:list_node, X10:node, X349:list_node, X393:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X8 @ X9 @ X10=>(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X10 @ X349 @ X393=>graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X8 @ (append_node @ X9 @ (tl_node @ X349)) @ X393)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_5_old_Opath2__app)).
1.69/1.89	thf(conj_0, conjecture, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
1.69/1.89	thf(fact_3_assms_I7_J, axiom, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_assms_I7_J)).
1.69/1.89	thf(fact_1_ri__is__valid, axiom, (i)=(sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_ri__is__valid)).
1.69/1.89	thf(c_0_7, plain, ![X7:g, X8:node, X9:list_node, X10:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X8 @ X9 @ X10=>(X8)=(hd_node @ X9)), inference(fof_simplification,[status(thm)],[fact_264_old_Opath2__hd])).
1.69/1.89	thf(c_0_8, plain, ~(![X145:node, X146:list_node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ X146 @ X145=>(member_node @ X145 @ (set_node2 @ ms)=>(![X12:node]:(member_node @ X12 @ (set_node2 @ (butlast_node @ X146))=>~member_node @ X12 @ (set_node2 @ ms))=>~prefix_node @ X146 @ rs2)))), inference(fof_simplification,[status(thm)],[fact_126__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062i_Ari_O_A_092_060lbrakk_062g_A_092_060turnstile_062_AdefNode_Ag_Ar_Nri_092_060rightarrow_062i_059_Ai_A_092_060in_062_Aset_Ams_059_A_092_060forall_062n_092_060in_062set_A_Ibutlast_Ari_J_O_An_A_092_060notin_062_Aset_Ams_059_Aprefix_Ari_Ars_092_060rbrakk_062_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062])).
1.69/1.89	thf(c_0_9, plain, ![X2336:g, X2337:node, X2338:list_node, X2339:node]:(~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2336 @ X2337 @ X2338 @ X2339|(X2337)=(hd_node @ X2338)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
1.69/1.89	thf(c_0_10, plain, ![X2130:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ esk97_0 @ esk96_0&(member_node @ esk96_0 @ (set_node2 @ ms)&((~member_node @ X2130 @ (set_node2 @ (butlast_node @ esk97_0))|~member_node @ X2130 @ (set_node2 @ ms))&prefix_node @ esk97_0 @ rs2))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
1.69/1.89	thf(c_0_11, plain, ![X4:list_node, X7:g, X8:node, X10:node]:((X8)=(hd_node @ X4)|~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X8 @ X4 @ X10), inference(split_conjunct,[status(thm)],[c_0_9])).
1.69/1.89	thf(c_0_12, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i, inference(split_conjunct,[status(thm)],[fact_4_ri__props_I1_J])).
1.69/1.89	thf(c_0_13, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r) @ esk97_0 @ esk96_0, inference(split_conjunct,[status(thm)],[c_0_10])).
1.69/1.89	thf(c_0_14, plain, (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r)=(hd_node @ ri), inference(spm,[status(thm)],[c_0_11, c_0_12])).
1.69/1.89	thf(c_0_15, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (hd_node @ ri) @ esk97_0 @ esk96_0, inference(rw,[status(thm)],[c_0_13, c_0_14])).
1.69/1.89	thf(c_0_16, plain, ![X2651:g, X2652:node, X2653:list_node, X2654:node, X2655:list_node, X2656:node]:(~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2651 @ X2652 @ X2653 @ X2654|(~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2651 @ X2654 @ X2655 @ X2656|graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2651 @ X2652 @ (append_node @ X2653 @ (tl_node @ X2655)) @ X2656)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_5_old_Opath2__app])])).
1.69/1.89	thf(c_0_17, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (hd_node @ ri) @ ri @ i, inference(rw,[status(thm)],[c_0_12, c_0_14])).
1.69/1.89	thf(c_0_18, plain, (hd_node @ ri)=(hd_node @ esk97_0), inference(spm,[status(thm)],[c_0_11, c_0_15])).
1.69/1.89	thf(c_0_19, negated_conjecture, ~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
1.69/1.89	thf(c_0_20, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r), inference(split_conjunct,[status(thm)],[fact_3_assms_I7_J])).
1.69/1.89	thf(c_0_21, plain, ![X4:list_node, X5:list_node, X8:node, X10:node, X7:g, X12:node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X8 @ (append_node @ X4 @ (tl_node @ X5)) @ X12|~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X8 @ X4 @ X10|~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X7 @ X10 @ X5 @ X12), inference(split_conjunct,[status(thm)],[c_0_16])).
1.69/1.89	thf(c_0_22, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ (hd_node @ esk97_0) @ ri @ i, inference(rw,[status(thm)],[c_0_17, c_0_18])).
1.69/1.89	thf(c_0_23, negated_conjecture, ~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ (sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r), inference(split_conjunct,[status(thm)],[c_0_19])).
1.69/1.89	thf(c_0_24, plain, (i)=(sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r), inference(split_conjunct,[status(thm)],[fact_1_ri__is__valid])).
1.69/1.89	thf(c_0_25, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (hd_node @ ri), inference(rw,[status(thm)],[c_0_20, c_0_14])).
1.69/1.89	thf(c_0_26, plain, ![X8:node, X4:list_node]:(graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X8 @ (append_node @ X4 @ (tl_node @ ri)) @ i|~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X8 @ X4 @ (hd_node @ esk97_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
1.69/1.89	thf(c_0_27, negated_conjecture, ~graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append_node @ ns @ (tl_node @ ri)) @ i, inference(rw,[status(thm)],[c_0_23, c_0_24])).
1.69/1.89	thf(c_0_28, plain, graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (hd_node @ esk97_0), inference(rw,[status(thm)],[c_0_25, c_0_18])).
1.69/1.89	thf(c_0_29, plain, ($false), inference(cdclpropres,[status(thm)],[c_0_26, c_0_27, c_0_28]), ['proof']).
1.69/1.89	# SZS output end CNFRefutation
1.69/1.89	# Proof object total steps             : 30
1.69/1.89	# Proof object clause steps            : 17
1.69/1.89	# Proof object formula steps           : 13
1.69/1.89	# Proof object conjectures             : 4
1.69/1.89	# Proof object clause conjectures      : 2
1.69/1.89	# Proof object formula conjectures     : 2
1.69/1.89	# Proof object initial clauses used    : 7
1.69/1.89	# Proof object initial formulas used   : 7
1.69/1.89	# Proof object generating inferences   : 3
1.69/1.89	# Proof object simplifying inferences  : 6
1.69/1.89	# Training examples: 0 positive, 0 negative
1.69/1.89	# Parsed axioms                        : 419
1.69/1.89	# Removed by relevancy pruning/SinE    : 0
1.69/1.89	# Initial clauses                      : 904
1.69/1.89	# Removed in clause preprocessing      : 99
1.69/1.89	# Initial clauses in saturation        : 805
1.69/1.89	# Processed clauses                    : 16737
1.69/1.89	# ...of these trivial                  : 167
1.69/1.89	# ...subsumed                          : 11570
1.69/1.89	# ...remaining for further processing  : 5000
1.69/1.89	# Other redundant clauses eliminated   : 1798
1.69/1.89	# Clauses deleted for lack of memory   : 0
1.69/1.89	# Backward-subsumed                    : 195
1.69/1.89	# Backward-rewritten                   : 82
1.69/1.89	# Generated clauses                    : 75095
1.69/1.89	# ...of the previous two non-trivial   : 69885
1.69/1.89	# Contextual simplify-reflections      : 19
1.69/1.89	# Paramodulations                      : 73049
1.69/1.89	# Factorizations                       : 6
1.69/1.89	# NegExts                              : 4
1.69/1.89	# Equation resolutions                 : 1846
1.69/1.89	# Propositional unsat checks           : 1
1.69/1.89	#    Propositional check models        : 0
1.69/1.89	#    Propositional check unsatisfiable : 1
1.69/1.89	#    Propositional clauses             : 57217
1.69/1.89	#    Propositional clauses after purity: 1448
1.69/1.89	#    Propositional unsat core size     : 3
1.69/1.89	#    Propositional preprocessing time  : 0.000
1.69/1.89	#    Propositional encoding time       : 0.066
1.69/1.89	#    Propositional solver time         : 0.004
1.69/1.89	#    Success case prop preproc time    : 0.000
1.69/1.89	#    Success case prop encoding time   : 0.066
1.69/1.89	#    Success case prop solver time     : 0.004
1.69/1.89	# Current number of processed clauses  : 3961
1.69/1.89	#    Positive orientable unit clauses  : 379
1.69/1.89	#    Positive unorientable unit clauses: 0
1.69/1.89	#    Negative unit clauses             : 1084
1.69/1.89	#    Non-unit-clauses                  : 2498
1.69/1.89	# Current number of unprocessed clauses: 53256
1.69/1.89	# ...number of literals in the above   : 142898
1.69/1.89	# Current number of archived formulas  : 0
1.69/1.89	# Current number of archived clauses   : 907
1.69/1.89	# Clause-clause subsumption calls (NU) : 1124883
1.69/1.89	# Rec. Clause-clause subsumption calls : 804468
1.69/1.89	# Non-unit clause-clause subsumptions  : 5050
1.69/1.89	# Unit Clause-clause subsumption calls : 117516
1.69/1.89	# Rewrite failures with RHS unbound    : 0
1.69/1.89	# BW rewrite match attempts            : 552
1.69/1.89	# BW rewrite match successes           : 48
1.69/1.89	# Condensation attempts                : 0
1.69/1.89	# Condensation successes               : 0
1.69/1.89	# Termbank termtop insertions          : 1725696
1.69/1.89	
1.69/1.89	# -------------------------------------------------
1.69/1.89	# User time                : 1.438 s
1.69/1.89	# System time              : 0.051 s
1.69/1.89	# Total time               : 1.489 s
1.69/1.89	# Maximum resident set size: 2660 pages
1.69/1.89	EOF